Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT

نویسندگان

  • Benno Stein
  • Oliver Niggemann
  • Theodor Lettmann
چکیده

Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system’s behavior analysis, the latter controls the actual diagnosis process. Especially when pursuing qualitative simulation, it makes sense to realize the simulation machinery with a logic calculus as well. Say, a qualitatively described hypothesis can directly be mapped onto an instance of the well-known SAT problem. Likewise, an entire diagnosis process, i. e., a sequence of hypothesis refinements, represents a set of SAT problems. This paper reports on the operationalization of such a SAT-based diagnosis approach. A specific characteristic here is the idea to exploit an ordering of the logical formulas according to their likeliness of being satisfiable. This idea is new in the context of qualitative reasoning, and it leads to a considerable speed up of the diagnosis process. Its applicability has been evaluated in the domain of hydraulic circuit diagnosis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

A Bi-Level Meta-heuristic Approach for a Hazardous Waste Management Problem

This study concentrates on designing a medical waste management system with a hierarchical structure, including a local government and a waste management planner. The upper-level seeks to design and control the waste management facilities by minimizing the environmental risks related to the disposal of medical waste. While the lower-level model is to determine the waste collection plans by only...

متن کامل

Applying Logic Synthesis for Speeding Up SAT

SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the SAT solver technology, for example, perfecting heuristics for variable ordering, and (2) by inventing new ways of constructing simpler SAT problems, either using domain specific information during the translation from...

متن کامل

Pruning Techniques for the SAT-based Bounded Model Checking Problem

Bounded Model Checking (BMC) is the problem of checking if a model satisses a temporal property in paths with bounded length k. Propositional SAT-based BMC is conducted in a gradual manner, by solving a series of SAT instances corresponding to formulations of the problem with increasing k. We show how the gradual nature can be exploited for shortening the overall veriication time. The concept i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006